Integer Points in Arithmetic Sequences
نویسنده
چکیده
We present a dynamical analog of the Mordell-Lang conjecture for integral points. We are able to prove this conjecture in the case of endomorphisms of semiabelian varieties.
منابع مشابه
Arithmetic Progressions on Conics.
In this paper, we look at long arithmetic progressions on conics. By an arithmetic progression on a curve, we mean the existence of rational points on the curve whose x-coordinates are in arithmetic progression. We revisit arithmetic progressions on the unit circle, constructing 3-term progressions of points in the first quadrant containing an arbitrary rational point on the unit circle. We als...
متن کاملInteger Sequences and Periodic Points
Arithmetic properties of integer sequences counting periodic points are studied, and applied to the case of linear recurrence sequences, Bernoulli numerators, and Bernoulli denominators.
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملEnumeration of Integer Points in Projections of Unbounded Polyhedra
We extend the Barvinok–Woods algorithm for enumeration of integer points in projections of polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the results to general formulas in Presburger Arithmetic. We also give an application to the k-Frobenius problem.
متن کاملModular Integer Arithmetic 1 Christoph Schwarzweller Institute of Computer
In this article we show the correctness of integer arithmetic based on Chinese Remainder theorem as described e.g. in [11]: Integers are transformed to finite sequences of modular integers, on which the arithmetic operations are performed. Retransformation of the results to the integers is then accomplished by means of the Chinese Remainder theorem. The method presented is a typical example for...
متن کامل